Stirling's Series Made Easy

Stirling's Series Made Easy

(A, B,C, D, . . . are positive constants), where the symbol means that rn lies between any two successive partial sums of the series. Usually (as in [1, pp. 529–534]) this formula is deduced from Euler’s summation formula. In this note we show how to compute in succession the constants A, B,C, . . . by a very simple technique. Only derivatives and limits of ln and of rational functions are invo...

Atom Bomb Made Easy

Concurrent Programming Made Easy

The task of programming concurrent systems is substantially more difficult than the task of programming sequential systems with respect to both correctness and efficiency. In this paper we describe a constraint-based methodology for writing concurrent applications. A system is modeled as: (a) a set of processes containing a sequence of “markers” denoting the processes points of interest; and (b...

Distributed CQL Made Easy

This talk is about making it easy to implement a distributed CQL. CQL is a continuous query language that extends SQL with a notion of windows over infinite streams of data. Programmers like using CQL, because its syntax is already familiar to them from their experience with other database-backed applications. CQL was originally designed to target a single node implementation of the Stanford St...

Dermatology Made Easy